An Object Based Algebra for Parallel Query Processing and Optimization
نویسندگان
چکیده
The Tarski algebra provides an algebraic foundation for object-based query languages. This is demonstrated by showing how queries expressed in a graph-oriented query language (based on the functional data model) can be translated into the Tarski algebra. The graphical representation of queries in combination with the Tarski algebra is a convenient mechanism to study optimization in the context of object based query languages. We then propose extensions to the Tarski algebra that facilitate parallel query processing and address the issue of parallel query optimization in this algebraic framework. We also show how our framework helps in the study of non-monotonic query optimization.
منابع مشابه
A Parallel Algebra for Object Databases
This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel relational database systems, there has been much less work on parallel object databases, and on parallel query processing for object databases. The parallel algebra presented in this paper is an extension of an existing...
متن کاملBeta-Algebra: Towards a Relational Algebra for Graph Analysis
Graph analysis is an essential tool to understand natural and man-made networks, such as social networks, food webs, transportation infrastructures, etc. Although graph analysis has fomented the development of algorithms, visual tools, and distributed processing frameworks, there is still little support for analysis at the query language level. Current graph query languages are mostly concerned...
متن کاملExtensible Query Processing in an Object-Oriented Database
In this thesis we address the problem of providing e cient processing of queries in the extensible environment induced by object-oriented databases. We de ne a framework for query processing in an object-oriented database and develop designs for major components of this framework. The framework encompasses an object-oriented data model, an algebra to query over that model, transformation rules ...
متن کاملA Uniform Calculus for Collection Types
We present a new algebra for collection types based on monoids and monoid ho-momorphisms. The types supported in this algebra can be any nested composition of collection types, including lists, sets, multisets (bags), vectors, and matrices. We also deene a new calculus for this algebra, called monoid comprehensions, that captures operations involving multiple collection types in declarative for...
متن کاملA Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has been done on temporal query processing and optimization. In this paper, we propose a uniform framework for processing temporal queries, which builds upon well-understood techniques for processing non-temporal queries. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992